Approximation in (Poly-) Logarithmic Space
نویسندگان
چکیده
منابع مشابه
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed k-TSP problem: given an asymmetric metric (V, d), a root r ∈ V and a target k ≤ |V |, compute the minimum length tour that contains r and at least k other vertices. We present a polynomial time O(log n · log k)-approximation algorithm for this problem. We use this algorithm for directed k-TSP t...
متن کاملConcurrent Zero-Knowledge in Poly-logarithmic Rounds
The subject of these notes is concurrent zero knowledge , in particular the construction given in [KP01]. Zero knowledgeness property of zero knowledge proof systems is defined with respect to an adversarial verifier that does not attempt to run multiple instances of a protocol concurrently. It is possible to prove that such protocols can be composed serially without substantial loss of securit...
متن کاملConcurrent Zero - Knowledge in Poly - logarithmic
A proof is concurrent zero-knowledge if it remains zero-knowledge when run in an asynchronous environment, such as the Internet. It is known that zero-knowledge is not necessarily preserved in such an environment; Kilian, Petrank and Rackoff have shown that any 4 rounds zero-knowledge interactive proof (for a non-trivial language) is not concurrent zero-knowledge. On the other hand, Richardson ...
متن کاملUnambiguous Functions in Logarithmic Space
We investigate different variants of unambiguity in the context of computing multi-valued functions. We propose a modification to the standard computation models of Turing machines and configuration graphs, which allows for unambiguity-preserving composition. We define a notion of reductions (based on function composition), which allows nondeterminism but controls its level of ambiguity. In lig...
متن کاملUnification and Logarithmic Space
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof theory and more specifically linear logic and Geometry of Interaction. We show how unification can be used to build a model of computation by means of specific su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2021
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-021-00826-7